Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
نویسندگان
چکیده
منابع مشابه
Ramsey Numbers for the Pair Sparse Graph-path or Cycle
Let G be a connected graph on n vertices with no more than n(\ + e) edges, and Pk or Ck a path or cycle with k vertices. In this paper we will show that if n is sufficiently large and e is sufficiently small then for k odd r(G, Ck) In 1. Also, for k > 2, r(G, Pk) = max{/i -t[k/2] l,n + k 2 a' 8), where a' is the independence number of an appropriate subgraph of G and 5 is 0 or 1 depending upon ...
متن کاملThe Cycle-Complete Graph Ramsey Numbers
In 1978 Erdős, Faudree, Rousseau, and Schelp conjectured that r (Cp, Kr) = (p − 1) (r − 1) + 1. for every p ≥ r ≥ 3, except for p = q = 3. This has been proved for r ≤ 6, and for p ≥ r 2 − 2r. In this note we prove the conjecture for p ≥ 4r + 2.
متن کاملOn cycle - Complete graph ramsey numbers
A new upper bound is given for the cycle-complete graph Ramsey number r(C,,,, K„), the smallest order for a graph which forces it to contain either a cycle of order m or a set of ri independent vertices . Then, another cycle-complete graph Ramsey number is studied, namely r( :C,,,, K„) the smallest order for a graph which forces it to contain either a cycle of order 1 for some I satisfying 3 :1...
متن کاملPath-kipas Ramsey numbers
For two given graphs F and H, the Ramsey number R(F,H) is the smallest positive integer p such that for every graph G on p vertices the following holds: either G contains F as a subgraph or the complement of G contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, K̂m), where Pn is a path on n vertices and K̂m is the graph obtained from the join of K1 and Pm. We determine the ...
متن کاملPath-fan Ramsey numbers
For two given graphs G and H , the Ramsey number R(G, H) is the smallest positive integer p such that for every graph F on p vertices the following holds: either F contains G as a subgraph or the complement of F contains H as a subgraph. In this paper, we study the Ramsey numbers R(Pn, Fm), where Pn is a path on n vertices and Fm is the graph obtained from m disjoint triangles by identifying pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1982
ISSN: 0002-9947
DOI: 10.2307/1998461